The van Hoeij Algorithm for Factoring Polynomials
نویسنده
چکیده
In this survey we report about a new algorithm for factoring polynomials due to Mark van Hoeij. The main idea is that the combinatorial problem which occurs in the Zassenhaus algorithm is reduced to a very special knapsack problem. In case of rational polynomials this knapsack problem can be very efficiently solved by the LLL algorithm. This gives a polynomial time algorithm which also works very well in practice.
منابع مشابه
Factoring Polynomials over Global Fields
We prove polynomial time complexity for a now widely used factorization algorithm for polynomials over the rationals. Our approach also yields polynomial time complexity results for bivariate polynomials over a finite field.
متن کاملFactoring Polynomials over Number Fields
The purpose of these notes is to give a substantially self-contained introduction to the factorization of polynomials over number fields. In particular, we present Zassenhaus’ algorithm and a factoring algorithm using lattice reduction, which were, respectively, the best in practice and in theory, before 2002. We give references for the van Hoeij-Novocin algorithm, currently the best both in pr...
متن کاملA relative van Hoeij algorithm over number fields
Van Hoeij’s algorithm for factoring univariate polynomials over the rational integers rests on the same principle as Berlekamp-Zassenhaus, but uses lattice basis reduction to improve drastically on the recombination phase. His ideas give rise to a collection of algorithms, differing greatly in their efficiency. We present two deterministic variants, one of which achieves excellent overall perfo...
متن کاملFactoring Polynomials and the Knapsack Problem
Although a polynomial time algorithm exists, the most commonly used algorithm for factoring a univariate polynomial f with integer coeecients is the Berlekamp-Zassenhaus algorithm which has a complexity that depends exponentially on n where n is the number of modular factors of f. This exponential time complexity is due to a combinatorial problem; the problem of choosing the right subset of the...
متن کاملThe complexity of factoring univariate polynomials over the rationals
This tutorial will explain the algorithm behind the currently fastest implementations for univariate factorization over the rationals. The complexity will be analyzed; it turns out that modifications were needed in order to prove a polynomial time complexity while preserving the best practical performance. The complexity analysis leads to two results: (1) it shows that the practical performance...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010